A symbolic decision procedure for cryptographic protocols with time stamps
نویسندگان
چکیده
منابع مشابه
A symbolic decision procedure for cryptographic protocols with time stamps
We present a symbolic decision procedure for time-sensitive cryptographic protocols. We consider protocols described in a process algebra-like notation that includes clocks, time-stamps and time variables. While the values of all clocks increase with rate one when time passes, time variables are simply variables that range over the time domain and can be used to remember time-stamps, i.e. time ...
متن کاملA Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract)
We present a symbolic decision procedure for time-sensitive cryptographic protocols. We consider protocols described in a process algebra-like notation that includes clocks, time-stamps and time variables. While the values of all clocks increase with rate one when time passes, time variables are simply variables that range over the time domain and can be used to remember time-stamps, i.e. time ...
متن کاملA Decision Procedure for Structured Cryptographic Protocols
Given a cryptographic protocol, it is possible to extract an inference system modelling exactly the set of messages an active intruder can learn by manipulating this protocol. Unfortunately, there is no general proof-search procedure to test whether or not a term belongs to the theory of an inference system. This paper presents the preliminary results obtained during an attempt to circumvent th...
متن کاملPoster: A Symbolic Logic with Concrete Bounds for Cryptographic Protocols
Large and complex cryptographic protocols form the backbone of internet security today. A lot of attention has focused on developing formal reasoning principles for proving the correctness of cryptographic protocols ([1], [2], [3], [4]). Formal techniques for proving correctness of cryptographic protocols have largely focused on the asymptotic computational model, where security guarantees are ...
متن کاملA Symbolic Logic with Concrete Bounds for Cryptographic Protocols
We present a formal logic for quantitative reasoning about security properties of network protocols. The system allows us to derive concrete security bounds that can be used to choose key lengths and other security parameters. We provide axioms for reasoning about digital signatures and random nonces, with security properties based on the concrete security of signature schemes and pseudorandom ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2005
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2004.09.007